#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)
#define FOR(i,a,b) for (int i = a; i <= b; i ++)
#define DOW(i,a,b) for (int i = b; i >= a; -- i)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 10010;
bool prime[N];
int 

inline void solution() {
  for (int i = 2; i <= N; i ++ ) {
    for (int j = 2; i * j <= N; j ++ ) {
      prime[i * j] = true;
    }
  }
  for (int i = 2; i <= 100; i ++ ) 
    if (!prime[i]) cout << i << " ";
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}